/*
 * graph2D
 * Copyright (c) 2011 Shun Moriya <shun@mnu.sakura.ne.jp>
 *
 * The MIT License
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR
 * THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 */

#include "messageTranslater.h"
#include <map>

namespace Graph2D
{
	namespace MessageTranslater
	{
		std::map<std::string, std::string> dictonary;	// not serialized !!!

		void clearDictonary()
		{
			dictonary.clear();
		}

		void addWord(const char* key, const char* word)
		{
			eraseWord(key);

			dictonary.insert(std::pair<std::string, std::string>(key, word));
		}

		void eraseWord(const char* key)
		{
			std::map<std::string, std::string>::iterator i = dictonary.find(key);
			if(i != dictonary.end())
			{
				dictonary.erase(i);
			}
		}

		void translate(std::string& text)
		{
			for(std::map<std::string, std::string>::iterator i = dictonary.begin(); i != dictonary.end(); i++)
			{
				const size_t length = (*i).first.size();

				int position = 0;
				while((position = text.find((*i).first, position)) != std::string::npos)
				{
					text.replace(position, length, (*i).second);
				}
			}
		}
	}
}
